Convergence and covering on graphs for wait-free robots
نویسندگان
چکیده
منابع مشابه
Wait-Free Gathering of Mobile Robots
The problem of gathering multiple mobile robots to a single location, is one of the fundamental problems in distributed coordination between autonomous robots. The problem has been studied and solved even for robots that are anonymous, disoriented, memoryless and operate in the semi-synchronous (ATOM) model. However all known solutions require the robots to be faulty-free except for the results...
متن کاملNotes on Wait-Free Spans
0. Introduction A number of key results in the theory of asynchronous, fault-tolerant computation of generalized consensus problems (known as decision tasks) are, at heart, topological. There is a developing body of research in this area that exploits the language and tools of combinatorial and algebraic topology. The seminal papers FLP, BMZ] assume an asynchronous message-passing model and req...
متن کاملPacking and Covering Triangles in K 4-free Planar Graphs
We show that every K4-free planar graph with at most ν edge-disjoint triangles contains a set of at most 32ν edges whose removal makes the graph triangle-free. Moreover, equality is attained only when G is the edge-disjoint union of 5-wheels plus possibly some edges that are not in triangles. We also show that the same statement is true if instead of planar graphs we consider the class of graph...
متن کاملMixed Covering Arrays on Graphs
We give upper and lower bounds on the size of mixed covering arrays on graphs based on graph homomorphisms. We provide constructions for covering arrays on graphs based on basic graph operations. In particular, we construct optimal mixed covering arrays on trees, cycles and bipartite graphs; the constructed optimal objects have the additional property of being nearly point balanced.
متن کاملCovering Arrays on Product Graphs
Two vectors x, y in Zg are qualitatively independent if for all pairs (a, b) ∈ Zg×Zg, there exists i ∈ {1, 2, . . . , n} such that (xi, yi) = (a, b). A covering array on a graph G, denoted by CA(n,G, g), is a |V (G)|×n array on Zg with the property that any two rows which correspond to adjacent vertices in G are qualitatively independent. The number of columns in such array is called its size. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2018
ISSN: 0104-6500,1678-4804
DOI: 10.1186/s13173-017-0065-8